An analytic study of partially ordered transport services
نویسندگان
چکیده
منابع مشابه
An analytic study of partially ordered transport services
This paper presents an analytic model for investigating the throughput, delay and bu er utilization characteristics of partially ordered transport services. We analyze the e ects of packet and ack losses as well as applications' order requirements on overall system performance. The analytic model is veri ed by comparing its results against those of an OPNET simulation model. Analytic results sh...
متن کاملOptimizing Partially Ordered Transport Services for Multimedia Applications
References [1, 5] introduce a transport protocol that o ers partially ordered service for multimedia applications. This paper investigates how much the selection of a linear extension a ects system performance in a partially ordered service. We rst show how to identify better linear extensions of a partial order, and then determine the performance gains by using such linear extensions at the ti...
متن کاملRetransmission-Based Partially Reliable Transport Service: An Analytic Model
This paper analytically studies retransmission-based partially reliable transport service. Results show that partially reliable transport service provides increasingly higher throughput and lower delay than reliable transport service as an application's loss tolerance increases and as the underlying network service gets more lossy. Also, to some degree, partially reliable transport service ease...
متن کاملTripled partially ordered sets
In this paper, we introduce tripled partially ordered sets and monotone functions on tripled partiallyordered sets. Some basic properties on these new dened sets are studied and some examples forclarifying are given.
متن کاملPartially Ordered Runs: A Case Study
We look at some sources of insecurity and difficulty in reasoning about partially ordered runs of distributed ASMs, and propose some techniques to facilitate such reasoning. As a case study, we prove in detail correctness and deadlock–freedom for general partially ordered runs of distributed ASM models of Lamport’s Bakery Algorithm.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Networks and ISDN Systems
سال: 1997
ISSN: 0169-7552
DOI: 10.1016/s0169-7552(96)00113-4